Performability Measure for Acyclic Markovian Models Hédi Nabli
نویسنده
چکیده
Degradable performance of fault-tolerant computer systems has given rise to considerable interest in mathematical models for combined evaluation of performance and reliability. Most of these models are based upon Markov processes. Several methods have been proposed for the computation of the probability distribution of performability upon an interval of time 0; t]. In this paper, two closed form expressions for the performability of \standard" acyclic models and uniform acyclic models are derived. Furthermore, an algorithm with a low polynomial computational complexity is presented and applied to a degradable computer system. Mesure de performabilit e pour des mod eles markoviens acycliques R esum e : Les syst emes multiprocesseurs tol erant les pannes ont donn e un champ d'int er^ et consid erable dans les mod eles math ematiques qui permettent l' evaluation combin ee des aspects de performance et de abilit e. La plupart de ces mod eles sont bas es sur les processus de Markov. Plusieurs m ethodes ont et e d evelopp ees pour le calcul de la distribution de la performabilit e sur un intervalle de temps donn e 0; t]. Dans cet article, nous proposons deux expressions explicites de la mesure de la performabilit e. La premi ere concerne les mod eles acycliques standards, la deuxi eme s'applique a des mod eles sp eciiques que l'on appelle acycliques uniformes. Par ailleurs, un algorithme de faible complexit e temporelle sera pr esent e et appliqu e a un syst eme informatique d egradable.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملPerformability Analysis for Degradable Computer Systems Hédi Nabli and Bruno Sericola
Degradable performance of fault-tolerant computer systems has given rise to considerable interest in mathematical models for combined evaluation of performance and reliability. Most of these models are based upon Markov processes. Several methods have been proposed for the computation of the probability distribution of performability upon an interval of time 0; t]. In this paper, we present a n...
متن کاملPerformability Analysis: A New Algorithm [Brief Contributions] - Computers, IEEE Transactions on
We propose, ifl this paper, a new algorithm to compute the performability distribution. Its computational complexity is polynomial and it deals only with nonnegative numbers bounded by one. This important property allows us to determine truncation steps and so to improve the execution time of the algorithm.
متن کاملComment on "Performability Analysis: A New Algorithm"
The paper “Performability Analysis: A New Algorithm” describes an algorithm for computing the complementary distribution of the accumulated reward over an interval of time in a homogeneous Markov process. In this comment, we show that in two particular cases, one of which is quite frequent, small modifications of the algorithm may reduce significantly its storage complexity.
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline-first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of se...
متن کامل